A Heuristic State Space Search Model for Security Protocol Verification

The vulnerability and importance of computers, robots, internet etc, demand the employment of exceedingly reliable security protocols. E-Business can not be encouraged with susceptible underlying security protocols. We present a heuristic state space search model for automatic security protocol verification. Our model exploits its knowledge of the search space and intelligently enhances the efficiency of security protocol verification process. It uses the representation of security protocols in terms of Strand Space Model (SSM) and logic of authentication. The attributes of security protocol are first represented in SSM and then interpreted into logic. This logical module is coded in the form of states. Our model accepts these states as its input and attempts to verify them. An efficient algorithm is used for the verification procedure. The goal is to avoid state space explosion problem and improve the overall efficiency by exploring maximum number of states in a given amount of time. The simplicity of our approach enables it to be translated into existing solutions for greater efficiency.